Adjoining Declassification and Attack Models by Abstract Interpretation

domain completeness Let < A, α, γ, C > a Galois insertion. [Cousot & Cousot ’77,’79] f : C −→ C, f = α ◦ f ◦ γ : A −→ A (b.c.a. of f) and ρ=γ ◦ α α(x) x f αf(x) =fα(x) ⊥ ⊥ a > > a ρ correct for f f α f(x) αf(x) Adjoining Declassification and Attack Models by Abstract Interpretation – p.5/19 Abstract domain completeness Let < A, α, γ, C > a Galois insertion. [Cousot & Cousot ’77,’79] f : C −→ C, f = α ◦ f ◦ γ : A −→ A (b.c.a. of f) and ρ=γ ◦ α α(x) x f αf(x) = fα(x)domain completeness Let < A, α, γ, C > a Galois insertion. [Cousot & Cousot ’77,’79] f : C −→ C, f = α ◦ f ◦ γ : A −→ A (b.c.a. of f) and ρ=γ ◦ α α(x) x f αf(x) = fα(x) ⊥ ⊥ a > > a ρ complete for f f α ρfρ = ρf f(x) Adjoining Declassification and Attack Models by Abstract Interpretation – p.5/19 Standard non-interference Private Input Public Input